Search results for "Security association"

showing 2 items of 2 documents

Safeguarding the Ultra-dense Networks with the aid of Physical Layer Security: A review and a case study

2016

In the wake of the extensive application of the fourth generation system, investigations of new technologies have been moving ahead vigorously to embrace the next generation communications in 2020. Thereinto, the technique of ultra-dense networks (UDNs) serves as a key enabler in meeting the roaring mobile traffic demands. With the prevalence of mobile Internet services especially those involve the mobile payment, security has gained an unprecedented amount of attention and become a highlighted feature for the fifth generation. Resource allocation, one of the most significant tools on getting over the obstacle of ubiquitous interference as well as elevating the spectrum/energy efficiency, h…

General Computer Scienceinformation securityComputer scienceMobile computingresource allocationMobile Web02 engineering and technologyComputer securitycomputer.software_genreSecurity information and event managementPublic land mobile network0203 mechanical engineeringSecurity association0202 electrical engineering electronic engineering information engineeringMobile paymentGeneral Materials ScienceResource managementCloud computing securityIMT AdvancedGeneral EngineeringPhysical layer020302 automobile design & engineering020206 networking & telecommunicationsInformation securityComputer security modelultra-dense networksSecurity serviceNetwork Access ControlNetwork security policyResource allocationlcsh:Electrical engineering. Electronics. Nuclear engineeringlcsh:TK1-9971computer5GEfficient energy useIEEE Access
researchProduct

Privacy-preserving scheme for mobile ad hoc networks

2011

This paper proposes a decentralized trust establishment protocol for mobile ad hoc networks (MANETs), where nodes establish security associations. In order to achieve privacy and security, we use homomorphic encryption and polynomial intersection so as to find the intersection of two sets. The first set represents a list of recommenders of the initiator and the second set is a list of trusted recommenders of the responder. The intersection of the sets represents a list of nodes that recommend the first node and their recommendations are trusted by the second node. In our experimental results we show that our scheme is effective even if there are 30 trusted nodes.

Vehicular ad hoc networkComputer scienceWireless ad hoc networkbusiness.industryMobile computingCryptographyMobile ad hoc networkEncryptionQA76Optimized Link State Routing ProtocolSecurity associationReputation systemComputer Science::Networking and Internet ArchitecturebusinessComputer Science::Cryptography and SecurityComputer network2011 IEEE Symposium on Computers and Communications (ISCC)
researchProduct